Method and apparatus for model-order reduction and sensitivity analysis

ABSTRACT

A method and apparatus for model-order reduction and sensitivity analysis of VLSI interconnect circuits, is disclosed. It has been known that reduced-order models can be yielded using the congruence transformation, which contains information of circuit moments of both circuit network and its corresponding adjoint network. By exploring symmetric properties of the modified nodal analysis (MNA) formulation, the method needs only half of the system moment information compared with the previous ones. Passivity of the reduced-order model is still preserved. The relationship between the adjoint network and the sensitivity analysis will also be disclosed.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to methods of model-order reduction and sensitivity analysis for VLSI interconnect circuits, and more particularly to a method of one-sided projection.

[0003] 2. Description of Related Art

[0004] With considering the issues of the signal integrity in high-speed VLSI designs, interconnects are often modeled as lumped RLC networks. To analyze an RLC linear network, the modified nodal analysis (MNA) can be used as follows: $\begin{matrix} \begin{matrix} {{M\frac{{x(t)}}{t}} = {{- {{Nx}(t)}} + {{Bu}(t)}}} \\ {{{y(t)} = {D^{T}{x(t)}}},} \end{matrix} & (1) \end{matrix}$

[0005] where M,N∈R^(n×n),x,B∈R^(n×m), D∈R^(n×p) and y∈R^(p×m). Matrices M and N containing capacitances, inductances, conductances and resistances are positive definite. The state matrix x(t) contains node voltages and branch currents of inductors, and u(t) and y(t) represent inputs and outputs. The adjoint equation associated with the system in Eq. (1) is of the form $\begin{matrix} {{{M\frac{{x_{a}(t)}}{t}} = {{- {{Nx}_{a}(t)}} + {{Du}(t)}}},} & (2) \end{matrix}$

[0006] which is the modified node equation of the adjoint network (or the dual system). If the m-port transfer functions are concerned, then p=m and D=B. The transfer functions of the state variables and of the outputs are X(s)=(N+sM)⁻¹B and Y(s)=B^(T)X(s). Conversely, those of the corresponding adjoint network are given as X_(a)(S)=(N^(T)+sM)⁻¹B.

[0007] Since the computational cost for simulating such large circuits is indeed tremendously huge, model-order reduction techniques have been proposed recently to reduce the computational complexity, for example, U.S. Pat. No. 5,313,398, U.S. Pat. No. 5,379,231, U.S. Pat. No. 5,537,329, U.S. Pat. No. 5,689,685, U.S. Pat. No. 5,920,484, U.S. Pat. No. 6,023,573, U.S. Pat. No. 6,041,170. Among these ways, the moment matching techniques based on Pade approximation and Krylov subspace projections take advantage of efficiency and numerical stability.

[0008] ‘Moment’ can be defined as follows. By expanding Y(s) about a frequency s₀∈C, we have ${{Y(s)} = {{\sum\limits_{i = {- \infty}}^{\infty}\quad {{Y^{(i)}\left( s_{0} \right)}\left( {s - s_{0}} \right)^{i}}} = {\sum\limits_{i = {- \infty}}^{\infty}{B^{T}{X^{(i)}\left( s_{0} \right)}\left( {s - s_{0}} \right)^{i}}}}},$

[0009] where

X ^((i))(s ₀)=(−(N+s ₀ M)⁻¹ M)^(i)(N+s ₀ M)⁻¹ B

[0010] is the i th-order system moment of X(s) about s₀ and Y^((i))(s₀) is the corresponding output moment. Similarly, the i th-order system moment of X_(a)(s) about s₀,

X _(a) ^((i))(s ₀)=(−(N ^(T) +s ₀ M)⁻¹ M)^(i)(N ^(T) +s ₀ M)⁻¹ B,

[0011] can be obtained.

[0012] In general, Krylov subspace projection methods can be divided into two categories: one-sided projection methods and two-sided projection methods. The one-sided projection methods use the congruence transformation to generate passive reduced-order models while the two-sided ones can not be guaranteed.

[0013] The one-sided projection method for moment matching to generate a reduced-order network of Eq. (1) is described as follows. First, a congruence transformation matrix V_(q) can be generated by the Krylov subspace methods. Let A=−(N+s₀M)⁻¹M and R=(N+s₀M)⁻¹B . The k th-order block Krylov subspace generated by A and R is defined as

K(A,R,k)=colsp{R,AR, . . . ,A^(k−1)R}=colsp(V_(q)),  (3)

[0014] where q≦km. colsp(V_(q)) represents span the vector space by columns of matrix V_(q). The Krylov subspace K(A,R,k) is indeed equal to the subspace spanned by system moments X^((i))(s₀) for i=0,1, . . . ,k−1. Matrix V_(q) can be iteratively generated by the block Arnoldi algorithm and thus be an orthonormal matrix. Next, by applying V_(q), n-dimensional state space can be projected onto a q-dimensional space, where q<<n: x(t)=V_(q){circumflex over (x)}(t). Then the reduced-order model can be calculated as

{circumflex over (M)}=V_(q) ^(T)MV_(q),{circumflex over (N)}=V_(q) ^(T)NV_(q),{circumflex over (B)}=V_(q) ^(T)B.  (4)

[0015] The transfer function of the reduced network is

Ŷ(s)={circumflex over (B)} ^(T)({circumflex over (N)}+s{circumflex over (M)})⁻¹ {circumflex over (B)}.

[0016] The corresponding i th-order output moment about s₀ is

Ŷ ^((i)) ={circumflex over (B)} ^(T)(−({circumflex over (N)}+s ₀ {circumflex over (M)})⁻¹ {circumflex over (M)})({circumflex over (N)}+s ₀ {circumflex over (M)})⁻¹ {circumflex over (B)}.

[0017] It can be shown that Y^((i))(s₀)=Ŷ^((i))(s₀) for i=0,1, . . . ,k−1 and the reduced-order model is passive.

[0018] However, linear independence of the columns in the block Krylov sequence, {R,AR, . . . ,A^(k−1)R}, is lost only gradually in general. In addition, the orthogonalization process to generate matrix V_(q) may be numerically ill-conditioned if the order k is extremely high. This invention will provide the adjoint network technique to overcome the above problem. Furthermore, the method will reduce the computational cost of constructing the projector.

SUMMARY OF THE INVENTION

[0019] This invention introduces an efficient technique to further reduce the computational cost of the one-sided projection methods. By exploring symmetric properties of the MNA formulation, we will show that the transfer functions and system moments of the adjoint network can be directly calculated from those of the original RLC network. The cost about constructing the congruence transformation matrix can be simplified up to 50% of the previous methods. In addition, it will be shown that this can be directly applied to the sensitivity analysis of the original circuits, and to generate the congruence transformation matrices for the sensitivity analysis of the reduced-order system.

[0020] Further benefits and advantages of the present invention will become apparent after a careful reading of the detailed description with appropriate reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0021]FIG. 1 is a flow chart of a method and apparatus for model-order reduction and sensitivity analysis in accordance with the present invention;

[0022]FIG. 2 is a couple tree-line circuit of the present invention;

[0023]FIG. 3 shows transfer functions of he far end of the aggressor net and the victim nets: (a) Net 1, (b) Net 2 and (c) Net 3; and

[0024]FIG. 4 shows sensitivity analysis of the far end of the aggressor net and the victim nets: (a) Net 1, (b) Net 2 and (c) Net 3.

DETAILED DESCRIPTION OF THE INVENTION

[0025]FIG. 1 illustrates the flow chart of this invention. Step 12 establishes the MNA matrices M, N, and B as in Eq. (1). Step 14 generates the Krylov matrix V_(q), which spans the k th-order block Krylov subspace defined in Eq. (3). Step 16 constructs the congruence transformation matrix U by using matrix V_(q), which will be stated as follows. Step 18 generates the corresponding reduced-order models by applying the congruence transformation technique with matrix U as in Eq. (4).

[0026] Frequency Response of Adjoint Networks

[0027] Suppose that nv and ni are the dimension of the node voltages and the branch currents in x(t). Let each port be connected with a current source so that B^(T)=[B_(v) ^(T) 0], where B_(v)∈R^(nv×m)$. Let the signature matrix S be defined as S=diag (I_(nv),−I_(ni)), where I represents an identity matrix. The symmetric properties of the MNA matrices are as follows:

S⁻¹=S, SMS=M, SNS=N^(T), SB=B  (5)

[0028] If port impedance parameters are concerned, each port is connected with a voltage source and thus B^(T)=[0 B_(i) ^(T)], where B_(i)∈R^(ni×m). To preserve the properties in Eq. (3), then {overscore (S)}=diag (−I_(nv),I_(ni)) will be used. If port transmission parameters are concerned, B^(T)=[B_(v) ^(T) B_(i) ^(T)], the properties in Eq. (5) can still be preserved using superposition principles. The relationship between the transfer functions of the original system X(s) and those of the adjoint network X_(a)(s) can be derived as follows: $\begin{matrix} \begin{matrix} {{X_{a}^{(i)}\left( s_{0} \right)} = {{- \left( {N^{T} + {s_{0}M}} \right)^{- 1}}{{MX}_{a}^{({i - 1})}\left( s_{0} \right)}}} \\ {= {{- \left\lbrack {{S\left( {N + {s_{0}M}} \right)}S} \right\rbrack^{- 1}}{{SMSSX}^{({i - 1})}\left( s_{0} \right)}}} \\ {= {S\left\lbrack {{- \left( {N + {s_{0}M}} \right)^{- 1}}{{MX}^{({i - 1})}\left( s_{0} \right)}} \right\rbrack}} \\ {= {{SX}^{(i)}\left( s_{0} \right)}} \end{matrix} & (6) \end{matrix}$

[0029] Thus X_(a)(S) can also be calculated from X(s) directly.

[0030] Reduced-Order Models Based on Projection

[0031] If matrix U is chosen as the congruence transformation matrix such that

{X ^((i))(s ₀),X _(a) ^((j))(s ₀)}∈colsp(U), 0≦i≦k, 0≦j≦l.  (7)

[0032] Then, Ŷ^((i))(s₀)=Y^((i))(s₀), 0≦i≦k+l+1. The reduced-order transfer function satisfies Ŷ(s)=Y(s)+O(s−s₀)^(K+l+2). In particular, if matrix U is built only from X^((i))(s₀) with no component from X_(a) ^((j))(s₀), then Ŷ^((i))(s₀)=Y^((i))(s₀), 0≦i≦k. Although Eq. (4) can overcome the numerical instability problem when generating the basis matrix U if order k+l+1 is extremely high, X_(a) ^((j))(s₀) and X^((i))(s₀) still need to be calculated individually for general RLC networks. The computational cost of generating U can not be reduced.

[0033] This invention provides the adjoint network method to reduce the computational cost of constructing the projector U as follows. Suppose that X^((i))(s₀)∈colsp(V_(q)) for 0≦i≦k−1 is a set of moments of X(s) about s₀ Then, it can be shown that X_(a) ^((i))(s₀)∈colsp(SV_(q)) for 0≦i≦k−1. V_(q) is the orthonormal matrix generated iteratively by the block Arnoldi algorithm. Let U=[V_(q) SV_(q)] be the congruence transformation matrix for model-order reductions. Therefore, moment Y^((i))(s₀) can be matched up to (2k −1)st-order by applying the congruence transformation matrix, that is,

Ŷ ^((i))(s ₀)=Y ^((i))(s ₀), for 0≦i≦2k−1  (8)

[0034] Sensitivity Analysis

[0035] We can also apply X_(a)(s)=SX(s) to perform the sensitivity analysis. If the sensitivity of the output Y(s) with respect to one circuit parameter λ is concerned, we have $\begin{matrix} {\frac{\partial{Y(s)}}{\partial\lambda} = {{- {X_{a}^{T}(s)}}\frac{\partial\left( {N + {sM}} \right)}{\partial\lambda}{X(s)}}} & (9) \end{matrix}$

[0036] Substituting the symmetrical property X_(a)(s)=SX(s) into Eq. (9), we get $\begin{matrix} {\frac{\partial{Y(s)}}{\partial\lambda} = {{- {X^{T}(s)}}S\frac{\partial\left( {N + {sM}} \right)}{\partial\lambda}{X(s)}}} & (10) \end{matrix}$

[0037] Thus the computational cost of sensitivity analysis can be reduced about 50% by only solving x(s).

[0038] Although we can perform the sensitivity analysis of the original network using Eq. (10) it is advisable to perform the sensitivity analysis by applying the model-order reduction techniques. In the previous works, the congruent transformation matrices V and V_(a) such that X^((i))(s₀)∈V and X_(a) ^((i))(s₀)∈V_(a) for 0≦i≦k−1 are constructed individually. However, in this invention, it is not hard to see that V=SV_(a). The proposed sensitivity analysis includes the following steps:

[0039] (1) calculate the congruence transformation matrix U=[V_(q/2) SV_(q/2)];

[0040] (2) generate the reduced order systems {{circumflex over (M)},{circumflex over (N)},{circumflex over (B)}} through the congruence transformation Eq. (4);

[0041] (3) solve ({circumflex over (N)}+s{circumflex over (M)}){circumflex over (X)}(s)={circumflex over (B)} for each frequency s; and

[0042] (4) map {circumflex over (X)}(s) back to the original and adjoint state spaces X(s) and SX(s).

[0043] Experimental Results

[0044] We provide an example, a coupled three-line circuit in FIG. 2, to show the efficiency of the proposed method. The line parameters are resistance: 3.5 Ω/cm, capacitance: 5.16 μF/cm, inductance: 3.47 nH/cm, coupling capacitance: 6 μF/cm and mutual inductance: 3.47 nH/cm. Nets 1, 2, and 3 are divided into 50, 100 and 150 sections, respectively. The dimension of the MNA matrices is 600×600 and the number of ports is 4. Suppose that the block Arnoldi algorithm is chosen to generate the orthonormal basis for the corresponding Krylov subspace during the whole experiment. We set shift frequency s₀=1 GHz and iteration number k=10. So q=40. The frequency responses of the original model and the reduced-order model generated by the block Arnoldi algorithm with the congruence transformation matrices U=V_(q)U=V_(2q), and U=[V_(q) SV_(q)] are illustrated in FIG. 3. The time to generate the reduced-order models are with U=V_(q): 1.50s, U=V_(2q): 3.86s, and the proposed U=[V_(q) SV_(q)]: 2.02s by using Matlab 6.1 with Pentium II 450 MHz CPU and 128 MB DRAM.

[0045] In addition, sensitivity analysis results are also compared. We choose λ to be the effective driver impedance at the near end of the aggressor net and total 101 frequency points ranged from 0 to 15 GHz to be simulated. The results are generated by the traditional adjoint method, the adjoint method with the 24th-order reduced-order models, and the proposed method are compared in FIG. 4. The simulation time of these models are 555.36s, 24.55s, and 14.15s, respectively. Therefore, it can be observed that the proposed method shows pretty good approximate results and takes less time.

[0046] Conclusions

[0047] An efficient model-order reduction technique for general RLC networks has been proposed in this invention. Extending the traditional projection method with considering both the original system and the adjoint network, the proposed method only needs to use one half of the original moment information by exploring symmetric properties of the MNA formulation. In addition, moment matching and passivity are preserved. Sensitivity analysis also can be efficiently calculated. Experimental results have demonstrated the accuracy and the efficiency of the proposal method.

[0048] Although the invention has been explained in relation to its preferred embodiment, it is to be understood that many other possible modifications and variations can be made without departing from the spirit and scope of the invention as hereinafter claimed. 

What is claimed is:
 1. A method of model-order reduction of RLC circuits. constructs the congruence transformation matrix U=[V_(q) SV_(q)]. Therefore, moments of Y(s) can be matched by moments of Ŷ(s) up to (2k −1)st-order by applying the congruence transformation matrix, that is, Ŷ ^((i))(s ₀₎₌ Y ^((i))(s ₀), for 0≦i≦2k−1, where Y(s)=B^(T)(N+sM)B represents the transfer function of the original system, and matrices M, N, and B are corresponding MNA matrices; V_(q) is generated by the Krylov subspace methods; let A=−(N+s₀M)⁻¹M and R=(N+s₀M)⁻¹B; s₀ is an given expansion frequency such that (N+s₀M) is nonsingular; the k th-order block Krylov subspace generated by A and R is defined as K(A,R,k)=colsp{R,AR, . . . ,A^(k−1)R}=colsp(V_(q)), where q≦km; colsp(V_(q)) represents span the vector space by columns of matrix V_(q); the signature matrix S is defined as S=diag(I_(nv),−I_(ni)), where I represents an identity matrix; nv and ni are the dimension of the node voltages and the branch currents; Ŷ(s)={circumflex over (B)}^(T)({circumflex over (N)}+s{circumflex over (M)}){circumflex over (B)} represents the transfer function of the reduced-order system, and matrices {circumflex over (M)}, {circumflex over (N)}, and {circumflex over (B)} are corresponding reduced-order MNA matrices that is generated by the congruence transformation: {circumflex over (M)}=U^(T)MU,{circumflex over (N)}=U^(T)NU,{circumflex over (B)}=U^(T)B; Y^((i))(s₀) is the i th-order moment of Y(s) at so and Ŷ^((i))(s₀) is the i th-order moment of Ŷ(s) at s₀.
 2. The method as claimed in claim 1, wherein the relationship between the original circuit and its corresponding adjoint network, X_(a)(s)=SX(s), can be directly applied to the sensitivity analysis of the original circuits, and to generate the congruence transformation matrices for the sensitivity analysis of the reduced-order system, which contains the following steps: (1) Calculate the congruence transformation matrix U=[V_(q/2) SV_(q/2)]; (2) Generate the reduced order systems {{circumflex over (M)},{circumflex over (N)},{circumflex over (B)}} through the congruence transformation; (3) Solve ({circumflex over (N)}+s{circumflex over (M)}){circumflex over (X)}(s)={circumflex over (B)} for each frequency s; (4) Map {circumflex over (X)}(s) back to the original and adjoint state spaces X(s) and SX(s); where X(s)=(N+sM)⁻¹B and X_(a)(s)=(N^(T)+sM)⁻B. 